(2 Mod 4)-cycles
نویسندگان
چکیده
For two integers k(> 0) and s(≥ 0), a cycle of length l is called an (s mod k)-cycle if l ≡ s mod k. In this paper, the following conjecture of Chen, Dean, and Shreve [5] is proved: Every 2-connected graph with at least six vertices and minimum degree at least three contains a (2 mod 4)-cycle.
منابع مشابه
Decomposition of complete bipartite multigraphs into paths and cycles having k edges
We give necessary and sufficient conditions for the decomposition of complete bipartite multigraph Km,n(λ) into paths and cycles having k edges. In particular, we show that such decomposition exists in Km,n(λ), when λ ≡ 0 (mod 2), m, n ≥ k2 , m + n > k, and k(p + q) = 2mn for k ≡ 0(mod 2) and also when λ ≥ 3, λm ≡ λn ≡ 0(mod 2), k(p + q) = λmn, m, n ≥ k, (resp., m,n ≥ 3k/2) for k ≡ 0(mod 4) (re...
متن کاملSquare Difference 3-Equitable Labeling of Paths and Cycles
A square difference 3-equitable labeling of a graph G with vertex set V is a bijection f from V to {1, 2,.... | V | } jg such that if each edge uv is assigned the label -1 if |[f (u)]2 [f (v)]2 | = -1(mod 4), the label 0 if |[f (u)]2 [f (v)]2 | = 0(mod 4) and the label 1 if |[f (u)]2 [f (v)]| = 1(mod 4), then the number of edges labeled with i and the number of edges labelled with j differ by a...
متن کاملSquare Difference 3-Equitable Labeling of Paths and Cycles
A square difference 3-equitable labeling of a graph G with vertex set V is a bijection f from V to {1, 2,.... | V | } jg such that if each edge uv is assigned the label -1 if |[f (u)]2 [f (v)]2 | = -1(mod 4), the label 0 if |[f (u)]2 [f (v)]2 | = 0(mod 4) and the label 1 if |[f (u)]2 [f (v)]| = 1(mod 4), then the number of edges labeled with i and the number of edges labelled with j differ by a...
متن کاملSquare Difference 3-Equitable Labeling of Paths and Cycles
A square difference 3-equitable labeling of a graph G with vertex set V is a bijection f from V to {1, 2,.... | V | } jg such that if each edge uv is assigned the label -1 if |[f (u)]2 [f (v)]2 | = -1(mod 4), the label 0 if |[f (u)]2 [f (v)]2 | = 0(mod 4) and the label 1 if |[f (u)]2 [f (v)]| = 1(mod 4), then the number of edges labeled with i and the number of edges labelled with j differ by a...
متن کاملSquare Difference 3-Equitable Labeling of Paths and Cycles
A square difference 3-equitable labeling of a graph G with vertex set V is a bijection f from V to {1, 2,.... | V | } jg such that if each edge uv is assigned the label -1 if |[f (u)]2 [f (v)]2 | = -1(mod 4), the label 0 if |[f (u)]2 [f (v)]2 | = 0(mod 4) and the label 1 if |[f (u)]2 [f (v)]| = 1(mod 4), then the number of edges labeled with i and the number of edges labelled with j differ by a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Ars Comb.
دوره 60 شماره
صفحات -
تاریخ انتشار 2001